Stochastic convex programming: basic duality

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Duality and Convex Programming

This chapter surveys key concepts in convex duality theory and their application to the analysis and numerical solution of problem archetypes in imaging.

متن کامل

Convex Stochastic Duality and the ÔBiting LemmaÔ

The paper analyzes dynamic problems of stochastic optimization in discrete time. The problems under consideration are concerned with maximizing concave functionals on convex sets of feasible strategies (programs). Feasibility is defined in terms of linear inequality constraints in L∞ holding almost surely. The focus of the work is the existence of dual variables – stochastic Lagrange multiplier...

متن کامل

Duality and Self-duality for Conic Convex Programming

This paper considers the problem of minimizing a linear function over the intersection of an aane space with a closed convex cone. In the rst half of the paper, we give a detailed study of duality properties of this problem and present examples to illustrate these properties. In particular, we introduce the notions of weak/strong feasibility or infeasibility for a general primal-dual pair of co...

متن کامل

Duality Results for Conic Convex Programming

This paper presents a uni ed study of duality properties for the problem of minimizing a linear function over the intersection of an a ne space with a convex cone in nite dimension. Existing duality results are carefully surveyed and some new duality properties are established. Examples are given to illustrate these new properties. The topics covered in this paper include Gordon-Stiemke type th...

متن کامل

Adaptive Importance Sampling via Stochastic Convex Programming

We show that the variance of the Monte Carlo estimator that is importance sampled from an exponential family is a convex function of the natural parameter of the distribution. With this insight, we propose an adaptive importance sampling algorithm that simultaneously improves the choice of sampling distribution while accumulating a Monte Carlo estimate. Exploiting convexity, we prove that the m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1976

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1976.62.173